Kinetic kd-Trees
نویسندگان
چکیده
We propose a simple variant of kd-trees, called rankbased kd-trees, for sets of points in R. We show that a rank-based kd-tree, like an ordinary kd-tree, supports range search queries in O(n1−1/d + k) time, where k is the output size. The main advantage of rank-based kd-trees is that they can be efficiently kinetized: the KDS processes O(n) events in the worst case, assuming that the points follow constantdegree algebraic trajectories, each event can be handled in O(log n) time, and each point is involved in O(1) certificates.
منابع مشابه
Kinetic Medians and kd-Trees
We propose algorithms for maintaining two variants of kd-trees of a set of moving points in the plane. A pseudo kd-tree allows the number of points stored in the two children to differ. An overlapping kd-tree allows the bounding boxes of two children to overlap. We show that both of them support range search operations in O(n) time, where 2 only depends on the approximation precision. When the ...
متن کاملRandomly Projected KD-Trees with Distance Metric Learning for Image Retrieval
Efficient nearest neighbor (NN) search techniques for highdimensional data are crucial to content-based image retrieval (CBIR). Traditional data structures (e.g., kd-tree) usually are only efficient for low dimensional data, but often perform no better than a simple exhaustive linear search when the number of dimensions is large enough. Recently, approximate NN search techniques have been propo...
متن کاملAn improvement in the build algorithm for Kd-trees using mathematical mean
Querying forms a central part of dealing with data. Hence, it becomes imperative to have efficient data structures and query-search algorithms for data retrieval. Among the different types of data structures, in this paper, we have focused on 4 tree data structures. These are B, Kd, Range and Quad trees. We have made a comparative study of their build processes. Traditionally, the median of dat...
متن کاملAccelerated and Extended Building of Implicit kd-Trees for Volume Ray Tracing
Implicit kd-trees have proven to greatly accelerate iso-surface rendering by ray tracing, such that interactive performance can already be achieved on a dual processor machine. However, the kd-tree could not be used for semi-transparent rendering and building the kd-tree was still a slow process that did not allow for rendering time-varying data sets. In this paper we extend the kd-tree to prov...
متن کاملHigh-dimensional Proximity Joins
Many emerging data mining applications require a proximity (similarity) join between points in a high-dimensional domain. We present a new algorithm that utilizes a new data structure, called the -kd tree, for fast spatial proximity joins on high-dimensional points. This data structure reduces the number of neighboring leaf nodes that are considered for the join test, as well as the traversal c...
متن کامل